On Perfect Coverings of Two-Dimensional Grids
نویسندگان
چکیده
We study perfect multiple coverings in translation invariant graphs with vertex set $\mathbb{Z}^2$ using an algebraic approach. In this approach we consider any such covering as a two-dimensional binary configuration which then express two-variate formal power series. Using known results, conclude that has non-trivial periodizer, is, there exists non-zero polynomial whose product the series presenting is two-periodic configuration. If periodizer line factors at most one direction, to be periodic. result, find many setups where of infinite grids are necessarily also some algorithmic questions on finding coverings.
منابع مشابه
On Perfect Matching Coverings and Even Subgraph Coverings
A perfect matching covering of a graph G is a set of perfect matchings of G such that every edge of G is contained in at least one member of it. Berge conjectured that every bridgeless cubic graph admits a perfect matching covering of order at most 5 (we call such a collection of perfect matchings a Berge covering of G). A cubic graph G is called a Kotzig graph if G has a 3-edge-coloring such t...
متن کاملCombination of Adaptive-Grid Embedding and Redistribution Methods on Semi Structured Grids for two-dimensional invisid flows
Among the adaptive-grid methods, redistribution and embedding techniques have been the focus of more attention by researchers. Simultaneous or combined adaptive techniques have also been used. This paper describes a combination of adaptive-grid embedding and redistribution methods on semi-structured grids for two-dimensional invisid flows. Since the grid is semi-structured, it is possible to us...
متن کاملCombination of Adaptive-Grid Embedding and Redistribution Methods on Semi Structured Grids for two-dimensional invisid flows
Among the adaptive-grid methods, redistribution and embedding techniques have been the focus of more attention by researchers. Simultaneous or combined adaptive techniques have also been used. This paper describes a combination of adaptive-grid embedding and redistribution methods on semi-structured grids for two-dimensional invisid flows. Since the grid is semi-structured, it is possible to us...
متن کاملNear Perfect Coverings in Graphs and Hypergraphs
Suppose we are given a bipartite graph with vertex set X, Y, IXI = n, I YI = N, each point in X( Y) has degree D(d) fixed, respectively, moreover, each pair of points x, x' E X has at most D/(log n)3 (common) neighbours. Let t(X, Y) denote the minimum number of vertices of Y needed to cover all vertices of X. We prove (Theorem 1.1) that t(X, Y)d/ n tends to 1 as n tends to infinity. This result...
متن کاملPerfect Domination of Rectangular Grids
Let m and n be positive integers. The algorithmic search for perfect dominating sets of the rectangular grid Gm;n satisfying an initial condition S 0 de ned as an admissible subset of a side Gm;1 of Gm;n such that S \ Gm;1 = S 0 is considered. A binary decision algorithm that generates all such perfect dominating sets is presented, and some related questions and conjectures are posed, leading t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-05578-2_12